New algorithm for solving pentadiagonal CUPL-Toeplitz linear systems
نویسندگان
چکیده
In this paper, based on the structure of pentadiagonal CUPL-Toeplitz matrix and Sherman–Morrison–Woodbury formula, we develop a new algorithm for solving nonsingular linear system. Some numerical examples are given in order to illustrate effectiveness proposed algorithms.
منابع مشابه
On Solving Pentadiagonal Linear Systems via Transformations
Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article is describes new numeric and symbolic algorithms for solving pentadiagonal linear systems via transformations. New algorithms are natural generalization of the work presented in [Moawwad ...
متن کاملA Method for Solving Special Circulant Pentadiagonal Linear Systems
A new effective modification of the method which is described in [1] for solving of real symmetric circulant pentadiagonal systems of linear equations is proposed. We consider the case where the coefficient matrix is not diagonal dominant. This paper shows efficiency and stability of the presented method.
متن کاملA parallel method for solving pentadiagonal systems of linear equations
A new parallel approach for solving a pentadiagonal linear system is presented. The parallel partition method for this system and the TW parallel partition method on a chain of P processors are introduced and discussed. The result of this algorithm is a reduced pentadiagonal linear system of order P 2 compared with a system of order 2P 2 for the parallel partition method. More importantly the n...
متن کاملTwo algorithms for solving general backward pentadiagonal linear systems
Abstract In this paper we present an efficient computational and symbolic algorithms for solving a backward pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA, and MATLAB are straightforward. An examples are given in order to illustrate the algorithms. The symbolic algorithm is competitive the other methods...
متن کاملA computational algorithm for special nth-order pentadiagonal Toeplitz determinants
In this short note, we present a fast and reliable algorithm for evaluating special nth-order pentadiagonal Toeplitz determinants in linear time. The algorithm is suited for implementation using Computer Algebra Systems (CAS) such as MACSYMA and MAPLE. Two illustrative examples are given. 2007 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational & Applied Mathematics
سال: 2023
ISSN: ['1807-0302', '2238-3603']
DOI: https://doi.org/10.1007/s40314-023-02253-6